Comparison of a Crossover Operator in Binary-coded Genetic Algorithms

نویسنده

  • STJEPAN PICEK
چکیده

Genetic algorithms (GAs) represent a method that mimics the process of natural evolution in effort to find good solutions. In that process, crossover operator plays an important role. To comprehend the genetic algorithms as a whole, it is necessary to understand the role of a crossover operator. Today, there are a number of different crossover operators that can be used in binary-coded GAs. How to decide what operator to use when solving a problem? When dealing with different classes of problems, crossover operators will show various levels of efficiency in solving those problems. A number of test functions with various levels of difficulty has been selected as a test polygon for determine the performance of crossover operators. The aim of this paper is to present a larger set of crossover operators used in genetic algorithms with binary representation and to draw some conclusions about their efficiency. Results presented here confirm the high-efficiency of uniform crossover and two-point crossover, but also show some interesting comparisons among others, less used crossover operators. Key–Words: Evolutionary computation, Genetic algorithms, Crossover operator, Efficiency, Binary representation, Test functions

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the effect of multi-parents recombination in binary coded genetic algorithms

-Recombination operator plays a very important role in genetic algorithms. In this paper, we present binary coded genetic algorithms in which more than two parents are involved in recombination operation. We propose two types of multi-parent recombination operators, the multi-cut (MX) and seed crossover (SX). Each of these operators is a natural generalization of two parents recombination opera...

متن کامل

Real-coded Genetic Algorithms with Simulated Binary Crossover: Studies on Multimodal and Multiobjective Problems

Real-coded genet ic algorit hms (GAs) do not use any coding of the problem variab les, instead they work dir ectly with the variab les . The main difference in the implementation of real-coded GAs and binary-coded GAs is in their recombination op erators. Alt ho ugh a number of real-cod ed crossover implementations were suggested, most of them were developed wit h intuition and wit hout much an...

متن کامل

Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation

Genetic algorithms (GAs) generate solutions to optimization problems using techniques inspired by natural evolution, like crossover, selection and mutation. In that process, crossover operator plays an important role as an analogue to reproduction in biological sense. During the last decades, a number of different crossover operators have been successfully designed. However, systematic comparis...

متن کامل

OPTIMUM PLACEMENT AND PROPERTIES OF TUNED MASS DAMPERS USING HYBRID GENETIC ALGORITHMS

Tuned mass dampers (TMDs) systems are one of the vibration controlled devices used to reduce the response of buildings subject to lateral loadings such as wind and earthquake loadings. Although TMDs system has received much attention from researchers due to their simplicity, the optimization of properties and placement of TMDs is a challenging task. Most research studies consider optimization o...

متن کامل

Simulated Binary Crossover for Continuous Search Space

Abst ract . T he success of binary-coded gene t ic algorithms (GA s) in problems having discrete sear ch space largely depends on the coding used to represent the prob lem var iables and on the crossover ope ra tor that propagates buildin g blocks from parent strings to children st rings . In solving optimization problems having continuous search space, binary-coded GAs discr et ize the search ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010